package com.wenhai.leetcode.stack;

/**
 * https://leetcode-cn.com/problems/implement-queue-using-stacks/
 *
 * @author wenhai
 * @date   2021/2/18
 */
public class _232用栈实现队列<E> {


    /** Initialize your data structure here. */
    public _232用栈实现队列() {

    }

//    /** Push element x to the back of queue. */
//    public void push(E e) {
//
//    }
//
//    /** Removes the element from in front of queue and returns that element. */
//    public E pop() {
//
//    }
//
//    /** Get the front element. */
//    public E peek() {
//
//    }
//
//    /** Returns whether the queue is empty. */
//    public boolean empty() {
//
//    }
}
